-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
نویسنده
چکیده
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desired property and then embed it to a larger game which encodes a NP-hard problem in order to prove the complexity of the desired property in a game. This technique is very efficient in proving NP-hardness for deciding the existence of Nash equilibria. In the paper, we illustrate the efficiency of the technique in proving the NP-hardness of deciding the existence of pure Nash equilibria of Matrix Scheduling Games and Weighted Connection Games. Moreover, using the technique, we can settle the complexity not only of the existence of equilibrium but also of the existence of good cost-sharing protocol.
منابع مشابه
Equilibria of Graphical Games with Symmetries
We study graphical games where the payoff function of each player satisfies one of four types of symmetry in the actions of his neighbors. We establish that deciding the existence of a pure Nash equilibrium is NP-hard in general for all four types. Using a characterization of games with pure equilibria in terms of even cycles in the neighborhood graph, as well as a connection to a generalized s...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملStrong Nash Equilibrium Is in Smoothed P
The computational characterization of game–theoretic solution concepts is a prominent topic in computer science. The central solution concept is Nash equilibrium (NE). However, it fails to capture the possibility that agents can form coalitions. Strong Nash equilibrium (SNE) refines NE to this setting. It is known that finding an SNE isNP–complete when the number of agents is constant. This har...
متن کاملA Survey on Supermodular Games
Supermodular games are an interesting class of games that exhibits strategic complementarity. There are several compelling reasons like existence of pure strategy nash equilibrium, dominance solvability, identical bounds on joint strategy space etc. that make them a strong candidate for game theoretic modeling of economics. Supermodular games give a sound framework for analysis as it is based o...
متن کاملComputing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute stro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009